//--------------------------------------------------------------------------------------
// File: test.cpp
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//--------------------------------------------------------------------------------------
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this
// file except in compliance with the License.  You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
// EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED WARRANTIES OR
// CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE, MERCHANTABLITY OR NON-INFRINGEMENT.
//
// See the Apache Version 2.0 License for specific language governing permissions
// and limitations under the License.
//
//--------------------------------------------------------------------------------------
//
/// <tags>P1</tags>
/// <summary>Create an array_view of type const type using extent values e0 and e1, and a container in a CPU restricted function. Verify extent and data in array_view</summary>
// RUN: %amp_device -D__GPU__ %s -m32 -emit-llvm -c -S -O3 -o %t.ll && mkdir -p %t
// RUN: %llc -march=c -o %t/kernel_.cl < %t.ll
// RUN: cat %opencl_math_dir/opencl_math.cl %t/kernel_.cl > %t/kernel.cl
// RUN: pushd %t && objcopy -B i386:x86-64 -I binary -O elf64-x86-64 kernel.cl %t/kernel.o && popd
// RUN: %cxxamp %link %t/kernel.o %s -o %t.out && %t.out
#include <amp.h>

#include "../../helper.h"

using namespace Concurrency;
using std::vector;

int main()
{
    const int m = 100, n = 80;
    const int size = m * n;

    //vector<const int> vec1(size);
    vector<int> vec1(size);
    for(int i = 0; i < size; i++) vec1[i] = i;

    //vector<const int> vec2(size);
    vector<const int> vec2(size);
    for(int i = 0; i < size; i++) vec2[i] = i;

    array_view<const int, 2> av1(m, n, vec1);
    array_view<int, 2> av2(m, n, vec2);

    if(m != av1.get_extent()[0]) // Verify extent
    {
        return 1;
    }


    if(n != av1.get_extent()[1]) // Verify extent
    {
        return 1;
    }

    // verify data
    if(!compare(vec1, av1))
    {
         return 1;
    }

    accelerator device;
//    if (!get_device(Device::ALL_DEVICES, device))
//    {
//        return 2;
//    }
    accelerator_view acc_view = device.get_default_view();
    
    // use in parallel_for_each
    parallel_for_each(acc_view, av2.get_extent(), [=] (index<2> idx) restrict(amp,cpu)
    {
        av2[idx] = av1[idx] + 1;
    });  
    
    // verify data    
    for(int i = 0; i < size; i++)
    {
        if(vec2[i] != i + 1)
        {
            return 1;
        } 
    }   

    return 0;
}

